Sciweavers

17680 search results - page 3501 / 3536
» Simulation of Computer Systems and Applications
Sort
View
ICALP
2009
Springer
16 years 2 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula
211
Voted
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
16 years 2 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
204
Voted
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
16 years 2 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
196
Voted
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
16 years 2 months ago
SQAK: doing more with keywords
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
Sandeep Tata, Guy M. Lohman
200
Voted
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
16 years 2 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
« Prev « First page 3501 / 3536 Last » Next »