Sciweavers

2482 search results - page 113 / 497
» Analysis and Presentation of Results for Mobile Local Search
Sort
View
IPCO
2010
210views Optimization» more  IPCO 2010»
15 years 4 months ago
A 3-Approximation for Facility Location with Uniform Capacities
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen G...
CIKM
2005
Springer
15 years 12 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
INFOCOM
2003
IEEE
15 years 11 months ago
Design and Analysis of an MST-Based Topology Control Algorithm
— In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multi-hop networks. In this al...
Ning Li, Jennifer C. Hou, Lui Sha
CIKM
2009
Springer
16 years 28 days ago
Characterizing and predicting search engine switching behavior
Search engine switching describes the voluntarily transition from one Web search engine to another. In this paper we present a study of search engine switching behavior that combi...
Ryen W. White, Susan T. Dumais
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 6 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis