Sciweavers

882 search results - page 113 / 177
» On self-embeddings of computable linear orderings
Sort
View
DAGSTUHL
2008
14 years 11 months ago
Uniprocessor EDF Feasibility is an Integer Problem
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
Enrico Bini
MVA
2007
155views Computer Vision» more  MVA 2007»
14 years 11 months ago
Pre-processing Algorithms on Digital Mammograms
Mammography is the best method for early mass detection. In order to limit the search for abnormalities by Computer Aided Diagnosis systems to the region of the breast without und...
Hengameh Mirzaalian, Mohammad Reza Ahmadzadeh, Sae...
UAI
2008
14 years 11 months ago
Tightening LP Relaxations for MAP using Message Passing
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
David Sontag, Talya Meltzer, Amir Globerson, Tommi...
AVI
2006
14 years 11 months ago
An integrated task-based framework for the design and evaluation of visualizations to support preferential choice
In previous work, we proposed ValueCharts, a set of visualizations and interactive techniques to support the inspection of linear models of preferences. We now identify the need t...
Jeanette Bautista, Giuseppe Carenini
ERSA
2006
111views Hardware» more  ERSA 2006»
14 years 11 months ago
Promises and Pitfalls of Reconfigurable Supercomputing
Reconfigurable supercomputing (RSC) combines programmable logic chips with high performance microprocessors, all communicating over a high bandwidth, low latency interconnection n...
Maya Gokhale, Christopher Rickett, Justin L. Tripp...