Sciweavers

92 search results - page 16 / 19
» On the Relative Hardness of Clustering Corpora
Sort
View
MOBICOM
2003
ACM
14 years 19 days ago
Topology control for wireless sensor networks
We consider a two-tiered Wireless Sensor Network (WSN) consisting of sensor clusters deployed around strategic locations and base-stations (BSs) whose locations are relatively fl...
Jianping Pan, Yiwei Thomas Hou, Lin Cai, Yi Shi, S...
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 7 days ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
CLA
2007
13 years 8 months ago
Representing Numeric Values in Concept Lattices
Formal Concept Analysis is based on the occurrence of symbolic attributes in individual objects, or observations. But, when the attribute is numeric, treatment has been awkward. In...
John L. Pfaltz
EDBT
2011
ACM
256views Database» more  EDBT 2011»
12 years 11 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
SIGIR
2005
ACM
14 years 28 days ago
Basic issues on the processing of web queries
Search engines represent a key component of Web economy these days. Despite that, there is not much technical literature available on their design, fine tuning, and internal oper...
Claudine Santos Badue, Ramurti A. Barbosa, Paulo B...