Sciweavers

6315 search results - page 435 / 1263
» Approximating Solution Structure
Sort
View
CIA
2006
Springer
15 years 11 months ago
Eliminating Interdependencies Between Issues for Multi-issue Negotiation
In multi-issue negotiations, issues may be negotiated independently or not. In the latter case, the utility associated with one issue depends on the value of another. These issue d...
Koen V. Hindriks, Catholijn M. Jonker, Dmytro Tykh...
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 11 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 10 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
16 years 1 months ago
Statistical similarity search applied to content-based video copy detection
—Content-based copy detection (CBCD) is one of the emerging multimedia applications for which there is a need of a concerted effort from the database community and the computer ...
Alexis Joly, Olivier Buisson, Carl Frélicot
AIRWEB
2008
Springer
15 years 9 months ago
Robust PageRank and locally computable spam detection features
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...