Sciweavers

4199 search results - page 577 / 840
» Generalizing Data in Natural Language
Sort
View
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
16 years 7 months ago
Single-pass online learning: performance, voting schemes and online feature selection
To learn concepts over massive data streams, it is essential to design inference and learning methods that operate in real time with limited memory. Online learning methods such a...
Vitor R. Carvalho, William W. Cohen
IJCV
2006
161views more  IJCV 2006»
15 years 6 months ago
Discriminative Random Fields
In this research we address the problem of classification and labeling of regions given a single static natural image. Natural images exhibit strong spatial dependencies, and mode...
Sanjiv Kumar, Martial Hebert
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
15 years 10 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (Ï­size), in both g...
Eli Ben-Sasson, Avi Wigderson
PLDI
2011
ACM
14 years 9 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
16 years 7 months ago
Representing and Querying Correlated Tuples in Probabilistic Databases
Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of pr...
Prithviraj Sen, Amol Deshpande