Sciweavers

4850 search results - page 49 / 970
» Approximate Data Structures with Applications
Sort
View
ICML
2005
IEEE
15 years 10 months ago
Learning class-discriminative dynamic Bayesian networks
In many domains, a Bayesian network's topological structure is not known a priori and must be inferred from data. This requires a scoring function to measure how well a propo...
John Burge, Terran Lane
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
14 years 1 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
SSDBM
2008
IEEE
111views Database» more  SSDBM 2008»
15 years 4 months ago
iJoin: Importance-Aware Join Approximation over Data Streams
We consider approximate join processing over data streams when memory limitations cause incoming tuples to overflow the available space, precluding exact processing. Selective evi...
Dhananjay Kulkarni, Chinya V. Ravishankar
AAAI
2000
14 years 11 months ago
Learning the Common Structure of Data
The proliferation of online information sources has accentuated the need for tools that automatically validate and recognize data. We present an efficient algorithm that learns st...
Kristina Lerman, Steven Minton
INFOCOM
2008
IEEE
15 years 4 months ago
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
Yan Wu, Sonia Fahmy, Ness B. Shroff