Sciweavers

5105 search results - page 159 / 1021
» An algorithm to determine peer-reviewers
Sort
View
COMPGEOM
1997
ACM
15 years 5 months ago
Time-Series Similarity Problems and Well-Separated Geometric Sets
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
Béla Bollobás, Gautam Das, Dimitrios...
107
Voted
SIBGRAPI
2000
IEEE
15 years 4 months ago
Ray Path Categorization
Edge detection and image segmentation algorithms usually operate on an image to extract geometrical information based on pixel colors. For ray-traced images, the presence of geomet...
Diego Nehab, Marcelo Gattass
69
Voted
ATAL
2010
Springer
15 years 1 months ago
Influence of different execution models on patrolling ant behaviors: from agents to robots
Generally, swarm models and algorithms consider synchronous agents, i.e., they act simultaneously. This hypothesis does not fit multi-agent simulators nor robotic systems. In this...
Arnaud Glad, Olivier Simonin, Olivier Buffet, Fran...
103
Voted
CIKM
2010
Springer
14 years 11 months ago
A method for discovering components of human rituals from streams of sensor data
This paper describes an algorithm for determining if an event occurs persistently within an interval where the interval is periodic but the event is not. The goal of the algorithm...
Athanasios Bamis, Jia Fang, Andreas Savvides
117
Voted
ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
14 years 10 months ago
Computing Sparse Multiples of Polynomials
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak