name stringlengths 1 3 | title stringlengths 17 118 | abstract stringlengths 268 2.12k | fulltext stringlengths 8.6k 78.1k | keywords stringlengths 28 1.35k |
|---|---|---|---|---|
89 | Evolutionary Learning with Kernels: A Generic Solution for Large Margin Problems | In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and see why this paradigm is successful for many pattern recognition problems. We then embed evolutionary computation into the most prominent repr... | INTRODUCTION
In this paper we will discuss how evolutionary algorithms
can be used to solve large margin optimization problems.
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided that copies are
not made or distributed for profit or commer... | Support vector machines;statistical learning theory;kernel methods;SVM;evolution strategies;large margin;particle swarms;machine learning;hybrid mutation;evolutionary computation;kernels |
9 | A Flexible and Extensible Object Middleware: CORBA and Beyond | This paper presents a CORBA-compliant middleware architecture that is more flexible and extensible compared to standard CORBA. The portable design of this architecture is easily integrated in any standard CORBA middleware; for this purpose, mainly the handling of object references (IORs) has to be changed. To encapsula... | INTRODUCTION
Middleware systems are heavily used for the implementation of
complex distributed applications. Current developments like mobile
environments and ubiquitous computing lead to new requirements
that future middleware systems will have to meet. Examples
for such requirements are the support for self-adaptatio... | integration;Flexible and extensible object middleware;IIOP;Software architecture for middleware;CORBA;object oriented;Extensions;Extensibility;extensibility;Middleware architecture;Distiributed applications;Ubiquitous computing;Object references;Middleware;extensible and reconfigurable middleware;Interoperability;distr... |
90 | Fan-out Measuring Human Control of Multiple Robots | A goal of human-robot interaction is to allow one user to operate multiple robots simultaneously. In such a scenario the robots provide leverage to the user's attention. The number of such robots that can be operated is called the fan-out of a human-robot team. Robots that have high neglect tolerance and lower interact... | INTRODUCTION
As computing becomes smaller, faster and cheaper the
opportunity arises to embed computing in robots that
perform a variety of "dull, dirty and dangerous" tasks that
humans would rather not perform themselves. For the
foreseeable future robots will not be fully autonomous, but
will be directed by humans. T... | multiple robots;Human-robot interaction;interaction time;fan-out;interaction effort;human-robot interaction;neglect time;user interface;fan-out equation;activity time |
91 | Fast String Sorting Using Order-Preserving Compression | We give experimental evidence for the benefits of order-preserving compression in sorting algorithms . While, in general, any algorithm might benefit from compressed data because of reduced paging requirements, we identified two natural candidates that would further benefit from order-preserving compression, namely str... | INTRODUCTION
In recent years, the size of corporate data collections has grown rapidly. For
example, in the mid-1980s, a large text collection was in the order of 500 MB.
Today, large text collections are over a thousand times larger. At the same
time, archival legacy data that used to sit in tape vaults is now held on... | Order-preserving compression;String sorting;random access;Order-preserving compression scheme;linear time algorithm;Sorting algorithms;word-RAM sorting algorithm;RAM;sorting;unit-cost;compression scheme;compression ratio;word-RAM;data collection;Keys of bounded length |
92 | FBRAM: A new Form of Memory Optimized for 3D Graphics | FBRAM, a new form of dynamic random access memory that greatly accelerates the rendering of Z-buffered primitives, is presented . Two key concepts make this acceleration possible. The first is to convert the read-modify-write Z-buffer compare and RGBα blend into a single write only operation. The second is to support t... | INTRODUCTION
One of the traditional bottlenecks of 3D graphics hardware has been
the rate at which pixels can be rendered into a frame buffer. Modern
interactive 3D graphics applications require rendering platforms
that can support 30 Hz animation of richly detailed 3D scenes. But
existing memory technologies cannot de... | FBRAM;Video output bandwidth;Dynamic random access memory;RGBa blend;dynamic memory;DRAM;Rendering rate;Z buffer;rendering;graphics;caching;memory;Dynamic memory chips;Pixel processing;3D graphics hardware;Acceleration;3D graphics;Z-buffer;Optimisation;Z-compare;pixel caching;VRAM;FBRam;Z-buffering;parallel graphics al... |
94 | Focused Named Entity Recognition Using Machine Learning | In this paper we study the problem of finding most topical named entities among all entities in a document, which we refer to as focused named entity recognition. We show that these focused named entities are useful for many natural language processing applications, such as document summarization , search result rankin... | INTRODUCTION
With the rapid growth of online electronic documents,
many technologies have been developed to deal with the
enormous amount of information, such as automatic summarization
, topic detection and tracking, and information
retrieval. Among these technologies, a key component is to
Permission to make digital ... | named entities;Information retrieval;naive Bayes;topic identification;classification model;sentence extraction;Summarization;entity recognition;Natural language processing applications;ranking;information retrieval;Linguistic features;automatic summarization;Classification methods;robust risk minimization;decision tree... |
95 | Formally Deriving an STG Machine | Starting from P. Sestoft semantics for lazy evaluation, we define a new semantics in which normal forms consist of variables pointing to lambdas or constructions. This is in accordance with the more recent changes in the Spineless Tagless G-machine (STG) machine, where constructions only appear in closures (lambdas onl... | INTRODUCTION
The Spineless Tagless G-machine (STG) [6] is at the heart
of the Glasgow Haskell Compiler (GHC) [7] which is perhaps
the Haskell compiler generating the most efficient code. For
a description of Haskell language see [8]. Part of the secret
for that is the set of analysis and transformations carried
out at ... | Lazy evaluation;operational semantics;Functional programming;STG machine;compiler verification;Closures;Translation scheme;Abstract machine;Stepwise derivation;Operational semantics;abstract machines;Haskell compiler |
96 | Building Bridges for Web Query Classification | Web query classification (QC) aims to classify Web users' queries, which are often short and ambiguous, into a set of target categories. QC has many applications including page ranking in Web search, targeted advertisement in response to queries, and personalization. In this paper, we present a novel approach for QC th... | INTRODUCTION
With exponentially increasing information becoming available
on the Internet, Web search has become an indispensable
tool for Web users to gain desired information. Typi-cally
, Web users submit a short Web query consisting of a
few words to search engines. Because these queries are short
and ambiguous, ho... | Bridging classifier;Category Selection;Ensemble classifier;Bridging Classifier;Target categories;Similarity distribution;Mapping functions;Search engine;Matching approaches;Intermediate categories;Taxonomy;Query enrichment;KDDCUP 2005;Query classification;Category selection;Web Query Classification |
97 | Geographically Focused Collaborative Crawling | A collaborative crawler is a group of crawling nodes, in which each crawling node is responsible for a specific portion of the web. We study the problem of collecting geographically -aware pages using collaborative crawling strategies. We first propose several collaborative crawling strategies for the geographically fo... | INTRODUCTION
While most of the current search engines are effective for
pure keyword-oriented searches, these search engines are not
fully effective for geographic-oriented keyword searches. For
instance, queries like "restaurants in New York, NY" or
"good plumbers near 100 milam street, Houston, TX" or
"romantic hotel... | geographical nodes;crawling strategies;Collaborative crawler;Evaluation criteria;URL based;Geographic Locality;Normalization and Disambiguation of City Names;Search engine;Geographically focused crawling;Scalability;Geographic locality;Collaborative crawling;Anchor text;collaborative crawling;Problems of aliasing and a... |
98 | GraalBench: A 3D Graphics Benchmark Suite for Mobile Phones | In this paper we consider implementations of embedded 3D graphics and provide evidence indicating that 3D benchmarks employed for desktop computers are not suitable for mobile environments. Consequently, we present GraalBench, a set of 3D graphics workloads representative for contemporary and emerging mobile devices . ... | INTRODUCTION
In recent years, mobile computing devices have been used for a
broader spectrum of applications than mobile telephony or personal
digital assistance. Several companies expect that 3D graphics applications
will become an important workload of wireless devices.
For example, according to [10], the number of u... | mechanism;workload characterization;API;Mobile devices;embedded 3D graphics;accelerators;3D graphics benchmarking;real-time;bottlenecks;rasterization;Graalbench;architecture;embedded systems;workload;benchmark;3D graphics;pipeline;Mobile environments;3D graphics applications;mobile phones;triangles;openGL;unit;GraalBen... |
99 | Handoff Trigger Table for Integrated 3G/WLAN Networks | Vertical handoff is a switching process between heterogeneous wireless networks in a hybrid 3G/WLAN network. Vertical handoffs fromWLAN to 3G network often fail due to the abrupt degrade of the WLAN signal strength in the transition areas. In this paper, a Handoff Trigger Table is introduced to improve the performance ... | INTRODUCTION
With the emergence of different wireless technologies, which
are developed for different purposes, the integration of these
wireless networks has attracted much attention from both
academia and industry. Among them, the integration of 3G
cellular networks and wireless local access networks (WLAN)
has becom... | WLAN;integrated networks;vertical handoff;cellular network;3G;Wireless communications;Handoff trigger table;wireles networks |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.