Sciweavers

925 search results - page 73 / 185
» Connectivity on Complete Lattices
Sort
View
SIGMETRICS
2002
ACM
15 years 5 months ago
Inferring client response time at the web server
As businesses continue to grow their World Wide Web presence, it is becoming increasingly vital for them to have quantitative measures of the client perceived response times of th...
David P. Olshefski, Jason Nieh, Dakshi Agrawal
CAD
2005
Springer
15 years 6 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
ICDE
2009
IEEE
160views Database» more  ICDE 2009»
16 years 8 months ago
MatchUp: Autocompletion for Mashups
A mashup is a Web application that integrates data, computation and GUI provided by several systems into a unique tool. The concept originated from the understanding that the numbe...
Serge Abiteboul, Ohad Greenshpan, Tova Milo, Neokl...
AAAI
2000
15 years 7 months ago
Generating Satisfiable Problem Instances
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
Dimitris Achlioptas, Carla P. Gomes, Henry A. Kaut...
APAL
2010
141views more  APAL 2010»
15 years 6 months ago
Locatedness and overt sublocales
Locatedness is one of the fundamental notions in constructive mathematics. The existence of a positivity predicate on a locale, i.e. the locale being overt, or open, has proved to ...
Bas Spitters