Sciweavers

5864 search results - page 163 / 1173
» Can We Work around Numerical Methods
Sort
View
130
Voted
VLDB
2010
ACM
144views Database» more  VLDB 2010»
15 years 2 months ago
Methods for finding frequent items in data streams
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
Graham Cormode, Marios Hadjieleftheriou
ISCIS
2004
Springer
15 years 10 months ago
Stubborn Sets for Priority Nets
Partial order methods, such as the stubborn set method and the priority method, reduce verification effort by exploiting irrelevant orders of events. We show how the stubborn set...
Kimmo Varpaaniemi
DAS
2008
Springer
15 years 6 months ago
A Fast Preprocessing Method for Table Boundary Detection: Narrowing Down the Sparse Lines Using Solely Coordinate Information
As the rapid growth of PDF document in digital libraries, recognizing the document structure and detecting specific document components are useful for document storage, classifica...
Ying Liu, Prasenjit Mitra, C. Lee Giles
CORR
2010
Springer
210views Education» more  CORR 2010»
15 years 4 months ago
Exploiting Statistical Dependencies in Sparse Representations for Signal Recovery
Signal modeling lies at the core of numerous signal and image processing applications. A recent approach that has drawn considerable attention is sparse representation modeling, in...
Tomer Faktor, Yonina C. Eldar, Michael Elad
ICML
2003
IEEE
16 years 5 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...