Sciweavers

1709 search results - page 71 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
15 years 7 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
126
Voted
ITCC
2000
IEEE
15 years 7 months ago
Projection-Based Multiuser Receiver over Frequency Selective Channels
In multiuser communication, the receiver’s performance is degraded by multiuser interference (MUI) as well as multipath distortions. This paper aims at elimination of these side...
Zhengyuan (Daniel) Xu
134
Voted
GECCO
2011
Springer
264views Optimization» more  GECCO 2011»
14 years 6 months ago
Critical factors in the performance of novelty search
Novelty search is a recently proposed method for evolutionary computation designed to avoid the problem of deception, in which the fitness function guides the search process away...
Steijn Kistemaker, Shimon Whiteson
137
Voted
EDBT
2010
ACM
202views Database» more  EDBT 2010»
15 years 9 months ago
Querying trajectories using flexible patterns
The wide adaptation of GPS and cellular technologies has created many applications that collect and maintain large repositories of data in the form of trajectories. Previous work ...
Marcos R. Vieira, Petko Bakalov, Vassilis J. Tsotr...
151
Voted
PODS
2003
ACM
132views Database» more  PODS 2003»
16 years 2 months ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy