Sciweavers

736 search results - page 105 / 148
» Approximating the Number of Network Motifs
Sort
View
AAAI
2004
14 years 11 months ago
Regrets Only! Online Stochastic Optimization under Time Constraints
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
Russell Bent, Pascal Van Hentenryck
ICCAD
2010
IEEE
119views Hardware» more  ICCAD 2010»
14 years 7 months ago
Symbolic system level reliability analysis
Abstract--More and more embedded systems provide a multitude of services, implemented by a large number of networked hardware components. In early design phases, dimensioning such ...
Michael Glaß, Martin Lukasiewycz, Felix Reim...
ICCV
2011
IEEE
13 years 10 months ago
Who Blocks Who: Simultaneous Clothing Segmentation for Grouping Images
Clothing is one of the most informative cues of human appearance. In this paper, we propose a novel multi-person clothing segmentation algorithm for highly occluded images. The ke...
Wang Nan, Haizhou Ai
INFOCOM
2007
IEEE
15 years 4 months ago
Small Active Counters
— The need for efficient counter architecture has arisen for the following two reasons. Firstly, a number of data streaming algorithms and network management applications requir...
Rade Stanojevic
COCOA
2009
Springer
15 years 2 months ago
Variable-Size Rectangle Covering
Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...
Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang