Sciweavers

1542 search results - page 180 / 309
» Kernelization of packing problems
Sort
View
FOCS
2006
IEEE
15 years 8 months ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans
MOBIQUITOUS
2005
IEEE
15 years 7 months ago
Multi-Constraint Dynamic Access Selection in Always Best Connected Networks
Abstract— In future generation networks, various access technologies, such as Wi-Fi, Bluetooth, GPRS and UMTS, etc., are simultaneously available to mobile devices. They vary in ...
Bo Xing, Nalini Venkatasubramanian
109
Voted
CVDB
2004
ACM
15 years 7 months ago
Event-Based Modeling and Processing of Digital Media
Capture, processing, and assimilation of digital media-based information such as video, images, or audio requires a unified framework within which signal processing techniques and...
Rahul Singh, Zhao Li, Pilho Kim, Derik Pack, Rames...
110
Voted
DAC
1996
ACM
15 years 6 months ago
Structural Gate Decomposition for Depth-Optimal Technology Mapping in LUT-based FPGA Design
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...
Jason Cong, Yean-Yow Hwang
NIPS
2003
15 years 3 months ago
Envelope-based Planning in Relational MDPs
A mobile robot acting in the world is faced with a large amount of sensory data and uncertainty in its action outcomes. Indeed, almost all interesting sequential decision-making d...
Natalia Hernandez-Gardiol, Leslie Pack Kaelbling