9842 search results - page 442 / 1969 » The Complexity of the Matching-Cut Problem |
219
Voted
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
218
Voted
PERCOM
2010
ACM
15 years 5 months ago
2010
ACM
Abstract—This paper looks at the scalability problems inherent in the Active Bat system: an outside-in ultrasonic location system. Such systems are typically associated with high...
216
click to vote
IEEEVAST
2010
15 years 2 months ago
2010
Co-located collaboration can be extremely valuable during complex visual analytics tasks. This paper presents an exploratory study of a system designed to support collaborative vi...
328
Voted
COMPGEOM
2011
ACM
14 years 11 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
256
Voted
GECCO
2011
Springer
14 years 11 months ago
2011
Springer
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...