Sciweavers

62 search results - page 6 / 13
» Picking the best DAISY
Sort
View
SPAA
2003
ACM
15 years 3 months ago
Online oblivious routing
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
92
Voted
PODS
2008
ACM
159views Database» more  PODS 2008»
15 years 10 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
75
Voted
CN
2000
107views more  CN 2000»
14 years 10 months ago
Query routing for Web search engines: architecture and experiments
General-purpose search engines such as AltaVista and Lycos are notorious for returning irrelevant results in response to user queries. Consequently, thousands of specialized, topi...
Atsushi Sugiura, Oren Etzioni
153
Voted
CVPR
2009
IEEE
16 years 6 months ago
Recognizing Linked Events: Searching the Space of Feasible Explanations
The ambiguity inherent in a localized analysis of events from video can be resolved by exploiting constraints between events and examining only feasible global explanations. We sho...
Dima Damen (University of Leeds), David Hogg (Univ...
CEC
2009
IEEE
15 years 5 months ago
Towards creative design using collaborative interactive genetic algorithms
— We present a computational model of creative design based on collaborative interactive genetic algorithms. We test our model on floorplanning. We guide the evolution of floor...
Juan C. Quiroz, Sushil J. Louis, Amit Banerjee, Se...