15033 search results - page 118 / 3007 » Complexity Theory and Algorithms |
130
Voted
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...
180
click to vote
MOBIHOC
2004
ACM
16 years 3 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
190
Voted
SENSYS
2006
ACM
15 years 9 months ago
2006
ACM
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
138
Voted
AI
2006
Springer
15 years 3 months ago
2006
Springer
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
125
Voted
JSC
2010
15 years 2 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...