Sciweavers

11484 search results - page 33 / 2297
» Modeling in the Large and Modeling in the Small
Sort
View
VC
2010
143views more  VC 2010»
13 years 3 months ago
A PDE method for patchwise approximation of large polygon meshes
Abstract Three-dimensional (3D) representations of complex geometric shapes, especially when they are reconstructed from magnetic resonance imaging (MRI) and computed tomography (C...
Yun Sheng, Alexei Sourin, Gabriela González...
JUCS
2010
108views more  JUCS 2010»
13 years 3 months ago
Extending the Methods for Computing the Importance of Entity Types in Large Conceptual Schemas
: Visualizing and understanding large conceptual schemas requires the use of specific methods. These methods generate clustered, summarized, or focused schemas that are easier to v...
Antonio Villegas, Antoni Olivé
SPIRE
2010
Springer
13 years 7 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
EUROCRYPT
2010
Springer
14 years 1 days ago
Constructing Verifiable Random Functions with Large Input Spaces
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
Susan Hohenberger, Brent Waters
IUI
2009
ACM
14 years 5 months ago
Searching large indexes on tiny devices: optimizing binary search with character pinning
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...
Guy Shani, Christopher Meek, Tim Paek, Bo Thiesson...