Sciweavers

238 search results - page 36 / 48
» Constraint Solving and Symbolic Execution
Sort
View
TIT
2008
74views more  TIT 2008»
14 years 10 months ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf
CCS
2010
ACM
14 years 9 months ago
NoTamper: automatic blackbox detection of parameter tampering opportunities in web applications
Web applications rely heavily on client-side computation to examine and validate form inputs that are supplied by a user (e.g., “credit card expiration date must be valid”). T...
Prithvi Bisht, Timothy Hinrichs, Nazari Skrupsky, ...
116
Voted
ICASSP
2011
IEEE
14 years 2 months ago
Source localization using time difference of arrival within a sparse representation framework
The problem addressed is source localization via time-differenceof-arrival estimation in a multipath channel. Solving this localization problem typically implies cross-correlating...
Ciprian R. Comsa, Alexander M. Haimovich, Stuart C...
AAAI
2006
15 years 8 days ago
Tractable Classes of Metric Temporal Problems with Domain Rules
In this paper, we will deal with some important kinds of metric temporal reasoning problems that arise in many real-life situations. In particular, events X0, X1 . . . XN are mode...
T. K. Satish Kumar
134
Voted
ICSOC
2010
Springer
14 years 8 months ago
Efficient QoS-Aware Service Composition with a Probabilistic Service Selection Policy
Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of ser...
Adrian Klein, Fuyuki Ishikawa, Shinichi Honiden