Sciweavers

123 search results - page 17 / 25
» Computing upper and lower bounds on likelihoods in intractab...
Sort
View
AUTOMATICA
2010
127views more  AUTOMATICA 2010»
13 years 5 months ago
Partitioning datasets based on equalities among parameters
When a phenomenon is described by a parametric model and multiple datasets are available, a key problem in statistics is to discover which datasets are characterized by the same p...
Riccardo Porreca, Giancarlo Ferrari-Trecate
JGAA
2006
127views more  JGAA 2006»
13 years 7 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
JALC
2007
90views more  JALC 2007»
13 years 7 months ago
Learning Unary Automata
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
Gregor Gramlich, Ralf Herrmann
INFOCOM
2007
IEEE
14 years 1 months ago
Joint Optimal Channel Probing and Transmission in Collocated Wireless Networks
— We consider a collocated wireless network where all links contend for a given channel and each link can hear others’ transmissions. Due to channel fading, the link condition ...
Dong Zheng, Junshan Zhang
ISPAN
1999
IEEE
13 years 11 months ago
Using Stochastic Intervals to Predict Application Behavior on Contended Resources
Current distributed parallel platforms can provide the resources required to execute a scientific application efficiently. However, when these platforms are shared by multiple use...
Jennifer M. Schopf, Francine Berman