Sciweavers

4679 search results - page 581 / 936
» Modeling When Connections Are the Problem
Sort
View
ICCV
2009
IEEE
16 years 11 months ago
GroupSAC: Efficient Consensus in the Presence of Groupings
We present a novel variant of the RANSAC algorithm that is much more efficient, in particular when dealing with problems with low inlier ratios. Our algorithm assumes that there...
Kai Ni, Hailin Jin, Frank Dellaert
CHI
2009
ACM
16 years 7 months ago
Learning to predict information needs: context-aware display as a cognitive aid and an assessment tool
We discuss the problem of assessing and aiding user performance in dynamic tasks that require rapid selection among multiple information sources. Motivated by research in human se...
Bradley C. Love, Matt Jones, Marc T. Tomlinson, Mi...
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 7 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
HICSS
2008
IEEE
111views Biometrics» more  HICSS 2008»
16 years 1 months ago
Cooperation and Coordination in Decentralized Communication Networks
Research has shown that decentralized networks and organizations perform better and have more satisfied members than centralized ones. Further, decentralized self-organizing netwo...
Devan Rosen
DATE
2007
IEEE
155views Hardware» more  DATE 2007»
16 years 1 months ago
Design fault directed test generation for microprocessor validation
Functional validation of modern microprocessors is an important and complex problem. One of the problems in functional validation is the generation of test cases that has higher p...
Deepak Mathaikutty, Sandeep K. Shukla, Sreekumar V...