Sciweavers

2488 search results - page 330 / 498
» Distributed Non-binary Constraints
Sort
View
SCP
2000
119views more  SCP 2000»
15 years 6 months ago
Automated compositional Markov chain generation for a plain-old telephone system
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
Holger Hermanns, Joost-Pieter Katoen
PAMI
2007
154views more  PAMI 2007»
15 years 5 months ago
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
PVLDB
2008
74views more  PVLDB 2008»
15 years 5 months ago
Out-of-order processing: a new architecture for high-performance stream systems
Many stream-processing systems enforce an order on data streams during query evaluation to help unblock blocking operators and purge state from stateful operators. Such in-order p...
Jin Li, Kristin Tufte, Vladislav Shkapenyuk, Vassi...
INFOCOM
2010
IEEE
15 years 4 months ago
Maximizing the Contact Opportunity for Vehicular Internet Access
Abstract—With increasing popularity of media enabled handhelds, the need for high data-rate services for mobile users is evident. Large-scale Wireless LANs (WLANs) can provide su...
Zizhan Zheng, Zhixue Lu, Prasun Sinha, Santosh Kum...
INFOCOM
2010
IEEE
15 years 4 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...