Sciweavers

1458 search results - page 114 / 292
» Monads for incremental computing
Sort
View
124
Voted
ICCV
2007
IEEE
16 years 5 months ago
Mode-seeking by Medoidshifts
We present a nonparametric mode-seeking algorithm, called medoidshift, based on approximating the local gradient using a weighted estimate of medoids. Like meanshift, medoidshift ...
Yaser Sheikh, Erum A. Khan, Takeo Kanade
BROADNETS
2007
IEEE
15 years 9 months ago
Resource dimensioning in WDM networks under state-based routing schemes
— Network dimensioning for wavelength-routed WDM networks has been extensively studied to maximize connection acceptance rate while minimizing the total cost. However, Internet s...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
ASC
2008
15 years 3 months ago
Info-fuzzy algorithms for mining dynamic data streams
Most data mining algorithms assume static behavior of the incoming data. In the real world, the situation is different and most continuously collected data streams are generated by...
Lior Cohen, Gil Avrahami, Mark Last, Abraham Kande...
SIGCSE
2006
ACM
179views Education» more  SIGCSE 2006»
15 years 9 months ago
Fifteen compilers in fifteen days
Traditional approaches to semester-long projects in compiler courses force students to implement the early stages of a compiler in depth; since many students fall behind, they hav...
Jeremy D. Frens, Andrew Meneely
ICCSA
2003
Springer
15 years 8 months ago
Robust Speaker Recognition Against Utterance Variations
A speaker model in speaker recognition system is to be trained from a large data set gathered in multiple sessions. Large data set requires large amount of memory and computation, ...
JongJoo Lee, JaeYeol Rheem, Ki Yong Lee