Sciweavers

15485 search results - page 183 / 3097
» Computing Optimal Subsets
Sort
View
STACS
1999
Springer
15 years 10 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
SIGGRAPH
1996
ACM
15 years 10 months ago
A Volumetric Method for Building Complex Models from Range Images
A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: i...
Brian Curless, Marc Levoy
INFOCOM
2011
IEEE
14 years 10 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna
KDD
2012
ACM
181views Data Mining» more  KDD 2012»
13 years 8 months ago
On "one of the few" objects
Objects with multiple numeric attributes can be compared within any “subspace” (subset of attributes). In applications such as computational journalism, users are interested i...
You Wu, Pankaj K. Agarwal, Chengkai Li, Jun Yang 0...
KDD
2003
ACM
269views Data Mining» more  KDD 2003»
16 years 6 months ago
Maximizing the spread of influence through a social network
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
David Kempe, Jon M. Kleinberg, Éva Tardos