Sciweavers

5210 search results - page 980 / 1042
» Exact geometric computation
Sort
View
JACM
2000
131views more  JACM 2000»
13 years 8 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
GIS
2002
ACM
13 years 8 months ago
Mapping Dilution of Precision (MDOP) and map-matched GPS
A novel method of map matching using the Global Positioning System (GPS) has been developed which uses digital mapping and height data to augment point position computation. This m...
Geoffrey Blewitt, George E. Taylor
INFORMS
1998
100views more  INFORMS 1998»
13 years 8 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
INFORMS
1998
150views more  INFORMS 1998»
13 years 8 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
CORR
1999
Springer
93views Education» more  CORR 1999»
13 years 8 months ago
On the Power of Positive Turing Reductions
: In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thu...
Edith Hemaspaandra