Sciweavers

10396 search results - page 1707 / 2080
» Testing Web Applications
Sort
View
ICALP
2009
Springer
16 years 7 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
203
Voted
PODS
2007
ACM
203views Database» more  PODS 2007»
16 years 6 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
MOBISYS
2006
ACM
16 years 6 months ago
Improved access point selection
This paper presents Virgil, an automatic access point discovery and selection system. Unlike existing systems that select access points based entirely on received signal strength,...
Anthony J. Nicholson, Yatin Chawathe, Mike Y. Chen...
WSDM
2010
ACM
172views Data Mining» more  WSDM 2010»
16 years 4 months ago
Early Online Identification of Attention Gathering Items In Social Media
Activity in social media such as blogs, micro-blogs, social networks, etc is manifested via interaction that involves text, images, links and other information items. Naturally, s...
Michael Mathioudakis, Nick Koudas, Peter Marbach
SOSP
2003
ACM
16 years 3 months ago
Performance debugging for distributed systems of black boxes
Many interesting large-scale systems are distributed systems of multiple communicating components. Such systems can be very hard to debug, especially when they exhibit poor perfor...
Marcos Kawazoe Aguilera, Jeffrey C. Mogul, Janet L...
« Prev « First page 1707 / 2080 Last » Next »