Sciweavers

282 search results - page 40 / 57
» Efficient bundle sorting
Sort
View
EDBT
2010
ACM
132views Database» more  EDBT 2010»
13 years 10 months ago
Turbo-charging hidden database samplers with overflowing queries and skew reduction
Recently, there has been growing interest in random sampling from online hidden databases. These databases reside behind form-like web interfaces which allow users to execute sear...
Arjun Dasgupta, Nan Zhang 0004, Gautam Das
CGF
2010
148views more  CGF 2010»
13 years 7 months ago
Hardware-Assisted Projected Tetrahedra
We present a flexible and highly efficient hardware-assisted volume renderer grounded on the original Projected Tetrahedra (PT) algorithm. Unlike recent similar approaches, our me...
André Maximo, Ricardo Marroquim, Ricardo C....
JMLR
2008
148views more  JMLR 2008»
13 years 7 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
SCN
2008
Springer
13 years 7 months ago
Simplified Submission of Inputs to Protocols
Consider an electronic election scheme implemented using a mix-net; a large number of voters submit their votes and then a smaller number of servers compute the result. The mix-net...
Douglas Wikström
CONSTRAINTS
2002
107views more  CONSTRAINTS 2002»
13 years 7 months ago
Fourier Elimination for Compiling Constraint Hierarchies
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring tha...
Warwick Harvey, Peter J. Stuckey, Alan Borning