Sciweavers

145 search results - page 9 / 29
» The Maximum Distinguishing Number of a Group
Sort
View
INFOCOM
2005
IEEE
15 years 3 months ago
Buffer sizing for congested Internet links
— Packet buffers in router/switch interfaces constitute a central element of packet networks. The appropriate sizing of these buffers is an important and open research problem. M...
Amogh Dhamdhere, Hao Jiang, Constantinos Dovrolis
LATIN
2000
Springer
15 years 1 months ago
Approximation Algorithms for Flexible Job Shop Problems
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...
COGSCI
2002
98views more  COGSCI 2002»
14 years 9 months ago
A simplicity principle in unsupervised human categorization
We address the problem of predicting how people will spontaneously divide into groups a set of novel items. This is a process akin to perceptual organization. We therefore employ ...
Emmanuel M. Pothos, Nick Chater
CRYPTO
2005
Springer
164views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
Composition Does Not Imply Adaptive Security
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
Krzysztof Pietrzak
SIGMOD
2000
ACM
158views Database» more  SIGMOD 2000»
15 years 1 months ago
NiagaraCQ: A Scalable Continuous Query System for Internet Databases
Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an ac...
Jianjun Chen, David J. DeWitt, Feng Tian, Yuan Wan...