Sciweavers

1689 search results - page 237 / 338
» Proximate point searching
Sort
View
GI
2008
Springer
15 years 5 months ago
Simple Back-end Services for Corporate Semantic Web
In order to be adopted within corporate environments, Semantic Web applications must provide tangible short-/medium-term gains. Although corporate Semantic Web offers enterprises n...
Robert Tolksdorf, Radoslaw Oldakowski, Thomas Hopp...
ICML
2010
IEEE
15 years 5 months ago
Sequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang
CONSTRAINTS
2008
90views more  CONSTRAINTS 2008»
15 years 4 months ago
Combining Tree Partitioning, Precedence, and Incomparability Constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
Nicolas Beldiceanu, Pierre Flener, Xavier Lorca
DATAMINE
2008
112views more  DATAMINE 2008»
15 years 4 months ago
PRIE: a system for generating rulelists to maximize ROC performance
Rules are commonly used for classification because they are modular, intelligible and easy to learn. Existing work in classification rule learning assumes the goal is to produce ca...
Tom Fawcett
145
Voted
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
15 years 4 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson