Sciweavers

271 search results - page 1 / 55
» Graph limits and parameter testing
Sort
View
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 5 months ago
Graph limits and parameter testing
Christian Borgs, Jennifer T. Chayes, Lászl&...
CN
1999
100views more  CN 1999»
13 years 4 months ago
Testing protocols modeled as FSMs with timing parameters
An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active t...
M. Ümit Uyar, Mariusz A. Fecko, Adarshpal S. ...
SODA
2010
ACM
179views Algorithms» more  SODA 2010»
14 years 2 months ago
Property Testing and Parameter Testing for Permutations
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...
EJC
2007
13 years 4 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
CORR
2007
Springer
134views Education» more  CORR 2007»
13 years 4 months ago
Rate-Constrained Wireless Networks with Fading Channels: Interference-Limited and Noise-Limited Regimes
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...
Masoud Ebrahimi, Amir K. Khandani