5115 search results - page 633 / 1023 » On Randomized Lanczos Algorithms |
160
click to vote
CIVR
2007
Springer
16 years 25 days ago
2007
Springer
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
196
click to vote
INFOCOM
2005
IEEE
16 years 7 days ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
206
click to vote
ESA
1995
Springer
15 years 10 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
185
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
179
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...