Sciweavers

2181 search results - page 279 / 437
» The restriction scaffold problem
Sort
View
IANDC
2011
127views more  IANDC 2011»
13 years 5 months ago
On the consistency, expressiveness, and precision of partial modeling formalisms
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
Ou Wei, Arie Gurfinkel, Marsha Chechik
CVPR
2005
IEEE
15 years 2 days ago
WaldBoost - Learning for Time Constrained Sequential Detection
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
Jan Sochman, Jiri Matas
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 10 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 10 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
14 years 4 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...