Sciweavers

5473 search results - page 1089 / 1095
» On the graph isomorphism problem
Sort
View
JACM
2000
131views more  JACM 2000»
13 years 9 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
COMCOM
1998
83views more  COMCOM 1998»
13 years 9 months ago
System for screening objectionable images
As computers and Internet become more and more available to families, access of objectionable graphics by children is increasingly a problem that many parents are concerned about....
James Ze Wang, Jia Li, Gio Wiederhold, Oscar Firsc...
CN
1999
100views more  CN 1999»
13 years 9 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. ...
INFORMS
1998
142views more  INFORMS 1998»
13 years 9 months ago
Distributed State Space Generation of Discrete-State Stochastic Models
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
Gianfranco Ciardo, Joshua Gluckman, David M. Nicol
CORR
2010
Springer
70views Education» more  CORR 2010»
13 years 9 months ago
Simultaneous communication in noisy channels
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...
Amit Weinstein
« Prev « First page 1089 / 1095 Last » Next »