Sciweavers

1160 search results - page 130 / 232
» A Colour Object Search Algorithm
Sort
View
SIGMOD
1989
ACM
94views Database» more  SIGMOD 1989»
15 years 7 months ago
Redundancy in Spatial Databases
Spatial objects other than points and boxes can be stored in spatial indexes, but the techniques usually require the use of approximations that can be arbitrarily bad. This leads ...
Jack A. Orenstein
AAAI
2007
15 years 5 months ago
Optimal Multi-Agent Scheduling with Constraint Programming
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...
Willem Jan van Hoeve, Carla P. Gomes, Bart Selman,...
PODS
2006
ACM
107views Database» more  PODS 2006»
16 years 3 months ago
Programmable clustering
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar
COMPGEOM
2010
ACM
15 years 8 months ago
Constructing Reeb graphs using cylinder maps
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
Harish Doraiswamy, Aneesh Sood, Vijay Natarajan
135
Voted
JOTA
2011
149views more  JOTA 2011»
14 years 10 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...