Sciweavers

138 search results - page 16 / 28
» The Complexity of Quickly ORM-Decidable Sets
Sort
View
COLT
2005
Springer
14 years 3 months ago
Learnability of Bipartite Ranking Functions
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
Shivani Agarwal, Dan Roth
MOBICOM
2004
ACM
14 years 3 months ago
Initializing newly deployed ad hoc and sensor networks
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
CGI
2003
IEEE
14 years 3 months ago
Virtualizing Real-World Objects
High quality, virtual 3D models are quickly emerging as a new multimedia data type with applications in such diverse areas as e-commerce, online encyclopaedias, or virtual museums...
Hendrik P. A. Lensch, Jan Kautz, Michael Goesele, ...
RSP
2003
IEEE
103views Control Systems» more  RSP 2003»
14 years 3 months ago
An Instruction Throughput Model of Superscalar Processors
With advances in semiconductor technology, processors are becoming larger and more complex. Future processor designers will face an enormous design space, and must evaluate more a...
Tarek M. Taha, D. Scott Wills
CIVR
2003
Springer
107views Image Analysis» more  CIVR 2003»
14 years 3 months ago
Fast Video Retrieval under Sparse Training Data
Feature selection for video retrieval applications is impractical with existing techniques, because of their high time complexity and their failure on the relatively sparse trainin...
Yan Liu, John R. Kender