Sciweavers

1257 search results - page 77 / 252
» A generalization of Euler's constant
Sort
View
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
14 years 19 days ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun
KDD
2000
ACM
121views Data Mining» more  KDD 2000»
14 years 15 days ago
Mining high-speed data streams
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
Pedro Domingos, Geoff Hulten
SI3D
1995
ACM
14 years 14 days ago
Visual Navigation of Large Environments Using Textured Clusters
A visual navigation system is described which uses texture mapped primitives to represent clusters of objects to maintain high and approximately constant frame rates. In cases whe...
Paulo W. C. Maciel, Peter Shirley
APPROX
2008
Springer
75views Algorithms» more  APPROX 2008»
13 years 11 months ago
On the Query Complexity of Testing Orientations for Being Eulerian
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
Eldar Fischer, Oded Lachish, Ilan Newman, Arie Mat...
NIPS
2007
13 years 10 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah