Sciweavers

5214 search results - page 893 / 1043
» The Online Specialization Problem
Sort
View
122
Voted
AAAI
2004
15 years 5 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...
136
Voted
APCCM
2006
15 years 5 months ago
Network data mining: methods and techniques for discovering deep linkage between attributes
Network Data Mining identifies emergent networks between myriads of individual data items and utilises special algorithms that aid visualisation of `emergent' patterns and tre...
John Galloway, Simeon J. Simoff
159
Voted
CSREAESA
2003
15 years 5 months ago
Common Mistakes in Adiabatic Logic Design and How to Avoid Them
Most so-called “adiabatic” digital logic circuit families reported in the low-power design literature are actually not truly adiabatic, in that they do not satisfy the general...
Michael P. Frank
135
Voted
NIPS
2004
15 years 5 months ago
Joint Tracking of Pose, Expression, and Texture using Conditionally Gaussian Filters
We present a generative model and stochastic filtering algorithm for simultaneous tracking of 3D position and orientation, non-rigid motion, object texture, and background texture...
Tim K. Marks, John R. Hershey, J. Cooper Roddey, J...
131
Voted
COLING
1996
15 years 5 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an