Sciweavers

2950 search results - page 139 / 590
» Computing with Infinitely Many Processes
Sort
View
ICIP
2003
IEEE
16 years 6 months ago
Parametric contour estimation by simulated annealing
Virtually all implementations of simulated annealing are simplified by assuming discrete unknowns, however continuous-parameter annealing has many potential applications to image ...
Michael Jamieson, Paul W. Fieguth, Leo J. Lee
IJBRA
2006
59views more  IJBRA 2006»
15 years 5 months ago
Predicting altered pathways using extendable scaffolds
: Many diseases, especially solid tumors, involve the disruption or deregulation of cellular processes. Most current work using gene expression and other high-throughput data, simp...
B. M. Broom, T. J. McDonnell, D. Subramanian
CVPR
2006
IEEE
16 years 7 months ago
Intelligent Collaborative Tracking by Mining Auxiliary Objects
Many tracking methods face a fundamental dilemma in practice: tracking has to be computationally efficient but verifying if or not the tracker is following the true target tends t...
Ming Yang, Ying Wu, Shihong Lao
DAM
2011
15 years 1 days ago
A General Label Search to investigate classical graph search algorithms
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
Richard Krueger, Geneviève Simonet, Anne Be...
ICPPW
1999
IEEE
15 years 9 months ago
Design and Development of a Cooperative Shopping System with Shared Discussion Space
At current on-line shops, buyers almost independently enjoy shopping without anyone's help. However, there are many cases where they cooperate with people such as personal ad...
Takayuki Umeda, Hiroyuki Tarumi, Yahiko Kambayashi