Sciweavers

1429 search results - page 67 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
IPM
2002
102views more  IPM 2002»
13 years 9 months ago
Problems of music information retrieval in the real world
Although a substantial number of research projects have addressed music information retrieval over the past three decades, the field is still very immature. Few of these projects ...
Donald Byrd, Tim Crawford
INFOCOM
2007
IEEE
14 years 3 months ago
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
Weiyi Zhang, Guoliang Xue, Satyajayant Misra
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 9 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
FOCS
1993
IEEE
14 years 1 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
13 years 9 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky