Sciweavers

2432 search results - page 152 / 487
» Degrees and choice numbers
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 6 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
SIGGRAPH
2009
ACM
16 years 28 days ago
Educating technophile artists: experiences from a highly successful computer animation undergraduate programme
Over the past few decades, the arts have become increasingly dependent on and influenced by the development of computer technology. In the 1960s pioneering artists experimented w...
Peter Comninos, Leigh McLoughlin, Eike Falk Anders...
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
15 years 12 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
BMCBI
2007
80views more  BMCBI 2007»
15 years 6 months ago
A network perspective on the topological importance of enzymes and their phylogenetic conservation
Background: A metabolic network is the sum of all chemical transformations or reactions in the cell, with the metabolites being interconnected by enzyme-catalyzed reactions. Many ...
Wei-chung Liu, Wen-hsien Lin, Andrew J. Davis, Fer...
CORR
2008
Springer
121views Education» more  CORR 2008»
15 years 6 months ago
The Forgiving Tree: A Self-Healing Distributed Data Structure
We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up t...
Tom Hayes, Navin Rustagi, Jared Saia, Amitabh Treh...