Sciweavers

4103 search results - page 120 / 821
» Some results on the Collatz problem
Sort
View
3DIM
2011
IEEE
14 years 6 months ago
Finding the Best Feature Detector-Descriptor Combination
Addressing the image correspondence problem by feature matching is a central part of computer vision and 3D inference from images. Consequently, there is a substantial amount of w...
Anders Lindbjerg Dahl, Henrik Aanæs, Kim Ste...
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
16 years 7 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin
ALDT
2009
Springer
186views Algorithms» more  ALDT 2009»
16 years 1 months ago
The Complexity of Probabilistic Lobbying
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
Gábor Erdélyi, Henning Fernau, Judy ...
WIA
2004
Springer
15 years 12 months ago
Testability of Oracle Automata
d abstract) Gaoyan Xie, Cheng Li, and Zhe Dang   School of Electrical Engineering and Computer Science Washington State University Pullman, WA 99164, USA Abstract. In this paper, ...
Gaoyan Xie, Cheng Li, Zhe Dang
CIE
2006
Springer
15 years 10 months ago
On Graph Isomorphism for Restricted Graph Classes
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
Johannes Köbler