Sciweavers

1568 search results - page 186 / 314
» The problem of examination questions in algorithmics
Sort
View
AI
2000
Springer
15 years 6 months ago
Towards adaptive Web sites: Conceptual framework and case study
The creation of a complex web site is a thorny problem in user interface design. In this paper we explore the notion of adaptive web sites: sites that semi-automatically improve t...
Mike Perkowitz, Oren Etzioni
VC
2011
106views more  VC 2011»
15 years 1 months ago
Width-bounded geodesic strips for surface tiling
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...
Joe Kahlert, Matt Olson, Hao Zhang 0002
PAKDD
2011
ACM
209views Data Mining» more  PAKDD 2011»
14 years 9 months ago
Spectral Analysis for Billion-Scale Graphs: Discoveries and Implementation
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
U. Kang, Brendan Meeder, Christos Faloutsos
ICS
2010
Tsinghua U.
15 years 10 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling
ICIP
2005
IEEE
16 years 19 hour ago
Automatic occlusion removal from minimum number of images
We examine the problem of combining several images to remove occlusions that occur in one or more of a sequence of images. A sequence of digital camera images of a photoworthy lan...
Cormac Herley