Sciweavers

62 search results - page 9 / 13
» Near Optimal Update-Broadcast of Data Sets
Sort
View
AAAI
2010
13 years 9 months ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
ICC
2007
IEEE
124views Communications» more  ICC 2007»
14 years 2 months ago
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks
—In a wireless sensor network, the network lifetime is an important issue when the size of the network is large. In order to make the network scalable, it is divided into a numbe...
Marudachalam Dhanaraj, C. Siva Ram Murthy
BMCBI
2006
116views more  BMCBI 2006»
13 years 7 months ago
HotSwap for bioinformatics: A STRAP tutorial
Background: Bioinformatics applications are now routinely used to analyze large amounts of data. Application development often requires many cycles of optimization, compiling, and...
Christoph Gille, Peter N. Robinson
ICMCS
2009
IEEE
110views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Visual content layer for scalable object recognition in urban image databases
Rich online map interaction represents a useful tool to get multimedia information related to physical places. With this type of systems, users can automatically compute the optim...
Xavier Baró, Sergio Escalera, Petia Radeva,...
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh