Sciweavers

10988 search results - page 2197 / 2198
» Algorithmic Folding Complexity
Sort
View
CVPR
2012
IEEE
11 years 7 months ago
Automatic discovery of groups of objects for scene understanding
Objects in scenes interact with each other in complex ways. A key observation is that these interactions manifest themselves as predictable visual patterns in the image. Discoveri...
Congcong Li, Devi Parikh, Tsuhan Chen
ICDCS
2012
IEEE
11 years 7 months ago
Tiresias: Online Anomaly Detection for Hierarchical Operational Network Data
Operational network data, management data such as customer care call logs and equipment system logs, is a very important source of information for network operators to detect prob...
Chi-Yao Hong, Matthew Caesar, Nick G. Duffield, Ji...
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
11 years 7 months ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal
WWW
2009
ACM
14 years 5 months ago
Incorporating site-level knowledge to extract structured data from web forums
Web forums have become an important data resource for many web applications, but extracting structured data from unstructured web forum pages is still a challenging task due to bo...
Jiang-Ming Yang, Rui Cai, Yida Wang, Jun Zhu, Lei ...
FSTTCS
2009
Springer
13 years 11 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
« Prev « First page 2197 / 2198 Last » Next »