Sciweavers

270 search results - page 33 / 54
» Exploiting Problem Structure for Solution Counting
Sort
View
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
14 years 4 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh
COCOA
2009
Springer
14 years 2 months ago
Matching Techniques Ride to Rescue OLED Displays
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
Andreas Karrenbauer
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
CVPR
2009
IEEE
15 years 2 months ago
HOP: Hierarchical Object Parsing
In this paper we consider the problem of object parsing, namely detecting an object and its components by composing them from image observations. Apart from object localization, ...
Iasonas Kokkinos, Alan L. Yuille
IJRR
2008
98views more  IJRR 2008»
13 years 7 months ago
Automatic Configuration Recognition Methods in Modular Robots
Recognizing useful modular robot configurations composed of hundreds of modules is a significant challenge. Matching a new modular robot configuration to a library of known configu...
Michael Park, Sachin Chitta, Alex Teichman, Mark Y...