973 search results - page 153 / 195 » New Bounds on Crossing Numbers |
188
click to vote
SISAP
2008
IEEE
16 years 15 days ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
163
click to vote
INFOCOM
2007
IEEE
16 years 13 days ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
186
click to vote
ICALP
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
161
click to vote
ICB
2007
Springer
16 years 8 days ago
2007
Springer
This paper investigates a new approach to formulate performance indices of biometric system using information theoretic models. The performance indices proposed here (unlike conven...
168
click to vote
ISSAC
2007
Springer
16 years 8 days ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...