Sciweavers

6105 search results - page 1180 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
POPL
2007
ACM
14 years 8 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
RECOMB
2005
Springer
14 years 8 months ago
Segmentation Conditional Random Fields (SCRFs): A New Approach for Protein Fold Recognition
Abstract. Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e. segmenta...
Yan Liu, Jaime G. Carbonell, Peter Weigele, Vanath...
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 8 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
ICS
2010
Tsinghua U.
14 years 5 months ago
Space-Efficient Estimation of Robust Statistics and Distribution Testing
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
Steve Chien, Katrina Ligett, Andrew McGregor
ICS
2010
Tsinghua U.
14 years 5 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
« Prev « First page 1180 / 1221 Last » Next »