Sciweavers

1355 search results - page 205 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
PVLDB
2008
122views more  PVLDB 2008»
13 years 7 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
CORR
2011
Springer
261views Education» more  CORR 2011»
13 years 2 months ago
Convex and Network Flow Optimization for Structured Sparsity
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
TOG
2010
117views more  TOG 2010»
13 years 2 months ago
Animation wrinkling: augmenting coarse cloth simulations with realistic-looking wrinkles
Moving garments and other cloth objects exhibit dynamic, complex wrinkles. Generating such wrinkles in a virtual environment currently requires either a time-consuming manual desi...
Damien Rohmer, Tiberiu Popa, Marie-Paule Cani, Ste...
ICDE
2009
IEEE
132views Database» more  ICDE 2009»
14 years 9 months ago
Using Anonymized Data for Classification
In recent years, anonymization methods have emerged as an important tool to preserve individual privacy when releasing privacy sensitive data sets. This interest in anonymization t...
Ali Inan, Murat Kantarcioglu, Elisa Bertino
ICDE
2004
IEEE
105views Database» more  ICDE 2004»
14 years 9 months ago
SPINE: Putting Backbone into String Indexing
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
Naresh Neelapala, Romil Mittal, Jayant R. Haritsa