Sciweavers

45 search results - page 2 / 9
» Discovering All Most Specific Sentences by Randomized Algori...
Sort
View
PVLDB
2008
127views more  PVLDB 2008»
13 years 8 months ago
Discovering data quality rules
Dirty data is a serious problem for businesses leading to incorrect decision making, inefficient daily operations, and ultimately wasting both time and money. Dirty data often ari...
Fei Chiang, Renée J. Miller
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 9 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 10 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
INFOCOM
2007
IEEE
14 years 2 months ago
Multiple-Choice Random Network for Server Load Balancing
Abstract—In many networking applications such as file sharing, structured peer-to-peer networks are increasingly used in dynamic situations with fluctuating load, which require...
Ye Xia, Alin Dobra, Seung Chul Han
ECCV
2006
Springer
14 years 10 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...