628 search results - page 121 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
190
click to vote
FCCM
2011
IEEE
14 years 3 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
105
click to vote
SIAMCOMP
2002
14 years 11 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
PKDD
1999
Springer
15 years 3 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
ATAL
2009
Springer
15 years 24 days ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
111
click to vote
MM
2004
ACM
15 years 5 months ago
2004
ACM
Approximately 2 degrees in our 140 degree vision span has sharp vision. Many researchers have been fascinated by the idea of eyetracking integrated perceptual compression of an im...