Sciweavers

4860 search results - page 748 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
16 years 6 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
EDBT
2006
ACM
191views Database» more  EDBT 2006»
16 years 6 months ago
Distributed Spatial Clustering in Sensor Networks
Abstract. Sensor networks monitor physical phenomena over large geographic regions. Scientists can gain valuable insight into these phenomena, if they understand the underlying dat...
Anand Meka, Ambuj K. Singh
ICPR
2008
IEEE
16 years 28 days ago
Robust outdoor text detection using text intensity and shape features
Recognizing texts from camera images is a known hard problem because of the difficulties in text segmentation from the varied and complicated backgrounds. In this paper, we propo...
Zongyi Liu, Sudeep Sarkar
CG
2004
Springer
15 years 10 months ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li
CORR
2010
Springer
160views Education» more  CORR 2010»
15 years 6 months ago
New Results on Quantum Property Testing
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...