Sciweavers

3096 search results - page 553 / 620
» Theory and Use of the EM Algorithm
Sort
View
POPL
2007
ACM
14 years 9 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
SIGMOD
2008
ACM
161views Database» more  SIGMOD 2008»
14 years 9 months ago
Efficient pattern matching over event streams
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electroni...
Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Ne...
MOBIHOC
2004
ACM
14 years 8 months ago
Rate allocation in wireless sensor networks with network lifetime requirement
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Sin...
Yiwei Thomas Hou, Yi Shi, Hanif D. Sherali
SAC
2010
ACM
14 years 3 months ago
Adaptive internet services through performance and availability control
Cluster-based multi-tier systems provide a means for building scalable Internet services. Building adaptive Internet services that are able to apply appropriate system sizing and ...
Jean Arnaud, Sara Bouchenak
INFOCOM
2009
IEEE
14 years 3 months ago
Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
Elias Kehdi, Baochun Li