Sciweavers

4526 search results - page 636 / 906
» Algorithmic problems related to the Internet
Sort
View
ICML
2003
IEEE
16 years 7 months ago
Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
Jeremy Kubica, Andrew W. Moore, David Cohn, Jeff G...
CAV
2009
Springer
187views Hardware» more  CAV 2009»
16 years 7 months ago
A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
Nathan Kitchen, Andreas Kuehlmann
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
16 years 7 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
SIGMOD
2008
ACM
125views Database» more  SIGMOD 2008»
16 years 6 months ago
Categorical skylines for streaming data
The problem of skyline computation has attracted considerable research attention. In the categorical domain the problem becomes more complicated, primarily due to the partially-or...
Nikos Sarkas, Gautam Das, Nick Koudas, Anthony K. ...
183
Voted
CVPR
2010
IEEE
16 years 3 months ago
Finding Dots: Segmentation as Popping out Regions from Boundaries
Many applications need to segment out all small round regions in an image. This task of finding dots can be viewed as a region segmentation problem where the dots form one regio...
Elena Bernardis, Stella Yu