Sciweavers

23703 search results - page 4557 / 4741
» Learning from Demonstration
Sort
View
SPAA
2004
ACM
14 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
UIST
2004
ACM
14 years 3 months ago
Video-based document tracking: unifying your physical and electronic desktops
This paper presents an approach for tracking paper documents on the desk over time and automatically linking them to the corresponding electronic documents using an overhead video...
Jiwon Kim, Steven M. Seitz, Maneesh Agrawala
WWW
2004
ACM
14 years 3 months ago
Flexible on-device service object replication with replets
An increasingly large amount of such applications employ service objects such as Servlets to generate dynamic and personalized content. Existing caching infrastructures are not we...
Dong Zhou, Nayeem Islam, Ali Ismael
ADC
2004
Springer
105views Database» more  ADC 2004»
14 years 3 months ago
Do Clarity Scores for Queries Correlate with User Performance?
Recently the concept of a clarity score was introduced in order to measure the ambiguity of a query in relation to the collection in which the query issuer is seeking information ...
Andrew Turpin, William R. Hersh
AMAI
2004
Springer
14 years 3 months ago
Warped Landscapes and Random Acts of SAT Solving
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
Dave A. D. Tompkins, Holger H. Hoos
« Prev « First page 4557 / 4741 Last » Next »