Sciweavers

683 search results - page 14 / 137
» Randomized Data Structures for the Dynamic Closest-Pair Prob...
Sort
View
SDM
2010
SIAM
146views Data Mining» more  SDM 2010»
13 years 9 months ago
Evaluating Query Result Significance in Databases via Randomizations
Many sorts of structured data are commonly stored in a multi-relational format of interrelated tables. Under this relational model, exploratory data analysis can be done by using ...
Markus Ojala, Gemma C. Garriga, Aristides Gionis, ...
ICMCS
2009
IEEE
415views Multimedia» more  ICMCS 2009»
13 years 5 months ago
A new localized superpixel Markov random field for image segmentation
In this paper, we present a novel localized Markov random field (MRF) method based on superpixels for region segmentation. Early vision problems could be formulated as pixel label...
Xiaofeng Wang, Xiao-Ping Zhang
ICDT
2007
ACM
87views Database» more  ICDT 2007»
14 years 1 months ago
Query Evaluation on a Database Given by a Random Graph
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
Nilesh N. Dalvi
INFOCOM
2006
IEEE
14 years 1 months ago
On the Potential of Structure-Free Data Aggregation in Sensor Networks
— Data aggregation protocols can reduce the cost of communication, thereby extending the lifetime of sensor networks. Prior work on data aggregation protocols has focused on tree...
Kai-Wei Fan, Sha Liu, Prasun Sinha
BNCOD
2009
145views Database» more  BNCOD 2009»
13 years 8 months ago
Compacting XML Structures Using a Dynamic Labeling Scheme
Due to the growing popularity of XML as a data exchange and storage format, the need to develop efficient techniques for storing and querying XML documents has emerged. A common ap...
Ramez Alkhatib, Marc H. Scholl