Sciweavers

444 search results - page 59 / 89
» More Colourful Simplices
Sort
View
CVPR
2010
IEEE
13 years 9 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
IAJIT
2010
124views more  IAJIT 2010»
13 years 9 months ago
Uplink Downlink Limited Round Robin Scheduling Algorithms
: Several polling algorithms have been proposed to overcome the slot wastage problem due to the exchange of POLL or NULL packets in the case of no data to transmit. However, most o...
Rawya Rizk
JASIS
2010
125views more  JASIS 2010»
13 years 9 months ago
So mechanical or routine: The not original in Feist
The United States Supreme Court case of 1991, Feist Publications, Inc. v. Rural Tel. Service Co., continues to be highly significant for property in data and databases but remains...
Julian Warner
VL
2010
IEEE
247views Visual Languages» more  VL 2010»
13 years 9 months ago
Cleanroom: Edit-Time Error Detection with the Uniqueness Heuristic
Many dynamic programming language features, such as implicit declaration, reflection, and code generation, make it difficult to verify the existence of identifiers through standar...
Andrew J. Ko, Jacob O. Wobbrock
ACL
2010
13 years 9 months ago
Simple, Accurate Parsing with an All-Fragments Grammar
We present a simple but accurate parser which exploits both large tree fragments and symbol refinement. We parse with all fragments of the training set, in contrast to much recent...
Mohit Bansal, Dan Klein