Sciweavers

555 search results - page 78 / 111
» Decompositions of Grammar Constraints
Sort
View
INFOCOM
1998
IEEE
14 years 22 days ago
QoS Routing in Networks with Uncertain Parameters
We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate....
Dean H. Lorenz, Ariel Orda
IAT
2009
IEEE
14 years 3 months ago
Autonomous UAV Surveillance in Complex Urban Environments
We address the problem of multi-UAV surveillance in complex urban environments with occlusions. The problem consists of coordinating the flight of UAVs with on-board cameras so t...
Eduard Semsch, Michal Jakob, Dusan Pavlícek...
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 5 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
RECOMB
1998
Springer
14 years 21 days ago
The hierarchical organization of molecular structure computations
The task of computing molecular structure from combinations of experimental and theoretical constraints is expensive because of the large number of estimated parameters (the 3D co...
Cheng Che Chen, Jaswinder Pal Singh, Russ B. Altma...
NIPS
2003
13 years 9 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand