Sciweavers

2254 search results - page 57 / 451
» Computing the minimal covering set
Sort
View
DAC
1995
ACM
15 years 8 months ago
Multi-way Partitioning for Minimum Delay for Look-Up Table Based FPGAs
In this paper we present a set cover based approach (SCP) to multi-way partitioning for minimum delay for Look-Up Table based FPGAs. SCP minimizes the number of chip-crossings on ...
Prashant Sawkar, Donald E. Thomas
CVPR
2012
IEEE
13 years 6 months ago
Figure-ground segmentation by transferring window masks
We present a novel technique for figure-ground segmentation, where the goal is to separate all foreground objects in a test image from the background. We decompose the test image...
Daniel Küttel, Vittorio Ferrari
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 4 months ago
Group-Strategyproof Irresolute Social Choice Functions
We axiomatically characterize the class of pairwise irresolute social choice functions that are group-strategyproof according to Kelly's preference extension. The class is na...
Felix Brandt
PODS
2003
ACM
113views Database» more  PODS 2003»
16 years 4 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
MEDES
2010
ACM
14 years 11 months ago
UBI-hotspots: sustainable ecosystem infrastructure for real world urban computing research and business
We report a novel deployment of so-called UBI-hotspots in a city center to establish an ecosystem infrastructure for conducting diverse urban computing research and business in au...
Timo Ojala, V. Valkama, Hannu Kukka, Tommi Heikkin...