Sciweavers

7129 search results - page 1400 / 1426
» Approximation Algorithms for Treewidth
Sort
View
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 10 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
SIGGRAPH
2010
ACM
15 years 10 months ago
FASTCD: fracturing-aware stable collision detection
We present a collision detection (CD) method for complex and large-scale fracturing models that have geometric and topological changes. We first propose a novel dual-cone culling...
Jae-Pil Heo, Duksu Kim, Joon-Kyung Seong, Jeong-Mo...
181
Voted
SIGIR
2010
ACM
15 years 10 months ago
Extending average precision to graded relevance judgments
Evaluation metrics play a critical role both in the context of comparative evaluation of the performance of retrieval systems and in the context of learning-to-rank (LTR) as objec...
Stephen E. Robertson, Evangelos Kanoulas, Emine Yi...
ATAL
2006
Springer
15 years 10 months ago
Continuous refinement of agent resource estimates
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
David N. Morley, Karen L. Myers, Neil Yorke-Smith
CCS
2006
ACM
15 years 10 months ago
Secure function evaluation with ordered binary decision diagrams
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh
« Prev « First page 1400 / 1426 Last » Next »