Sciweavers

12825 search results - page 2061 / 2565
» Improved PLSOM algorithm
Sort
View
ESA
2008
Springer
142views Algorithms» more  ESA 2008»
15 years 8 months ago
Edge Coloring and Decompositions of Weighted Graphs
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
Uriel Feige, Mohit Singh
IMAGING
2003
15 years 8 months ago
Using Colour to Model Outliers
Computer vision applications are able to model and reconstruct three dimensional scenes from several pictures. In this work, we are interested in the group of algorithm that regis...
David Hasler, Sabine Süsstrunk
AAAI
1994
15 years 8 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
ADHOC
2008
103views more  ADHOC 2008»
15 years 7 months ago
Impact of sensor-enhanced mobility prediction on the design of energy-efficient localization
Energy efficiency and positional accuracy are often contradictive goals. We propose to decrease power consumption without sacrificing significant accuracy by developing an energy-...
Chuang-Wen You, Polly Huang, Hao-Hua Chu, Yi-Chao ...
ADHOC
2007
113views more  ADHOC 2007»
15 years 7 months ago
Channelization for dynamic multi-frequency, multi-hop wireless cellular networks
Multi-hop relaying in cellular networks can greatly increase capacity and performance by exploiting the best available links to a base station. We envision an environment in which...
Jaesheung Shin, Raju Kumar, Parthu Kishen, Thomas ...
« Prev « First page 2061 / 2565 Last » Next »