Sciweavers

167 search results - page 28 / 34
» Constraints for closest point finding
Sort
View
DEXA
2010
Springer
182views Database» more  DEXA 2010»
13 years 8 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 8 months ago
Maximal Intersection Queries in Randomized Input Models
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits...
AUTOMATICA
2006
113views more  AUTOMATICA 2006»
13 years 8 months ago
Least costly identification experiment for control
All approaches to optimal experiment design for control have so far focused on deriving an input signal (or input signal spectrum) that minimizes some control-oriented measure of ...
Xavier Bombois, Gérard Scorletti, Michel Ge...
HEURISTICS
2008
92views more  HEURISTICS 2008»
13 years 8 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
PRL
2006
115views more  PRL 2006»
13 years 8 months ago
A hybrid parallel projection approach to object-based image restoration
Approaches analyzing local characteristics of an image prevail in image restoration. However, they are less effective in cases of restoring images degraded by large size point spr...
Xin Fan, Hua Huang, Dequn Liang, Chun Qi