Sciweavers

8094 search results - page 1551 / 1619
» Improvements in Formula Generalization
Sort
View
COMGEO
2010
ACM
13 years 11 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
CGF
2008
84views more  CGF 2008»
13 years 11 months ago
Visualizing Underwater Ocean Optics
Simulating the in-water ocean light field is a daunting task. Ocean waters are one of the richest participating media, where light interacts not only with water molecules, but wit...
Diego Gutierrez, Francisco J. Serón, Adolfo...
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 11 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
CN
2008
106views more  CN 2008»
13 years 11 months ago
Efficient virtual-backbone routing in mobile ad hoc networks
Since the physical topology of Mobile Ad hoc Networks (MANETs) is generally unstable, an appealing approach is the construction of a stable and robust virtual topology or backbone...
Jamal N. Al-Karaki, Ahmed E. Kamal
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 11 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
« Prev « First page 1551 / 1619 Last » Next »