Sciweavers

2100 search results - page 118 / 420
» Fundamentals of the problem
Sort
View
DAC
2008
ACM
16 years 7 months ago
Enhancing timing-driven FPGA placement for pipelined netlists
FPGA application developers often attempt to use pipelining, Cslowing and retiming to improve the performance of their designs. Unfortunately, such registered netlists present a f...
Kenneth Eguro, Scott Hauck
ICML
2005
IEEE
16 years 7 months ago
Active learning for Hidden Markov Models: objective functions and algorithms
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
Brigham Anderson, Andrew Moore
ICMCS
2008
IEEE
245views Multimedia» more  ICMCS 2008»
16 years 28 days ago
A novel local feature descriptor for image matching
Image matching is a fundamental task of many problems in computer vision. This paper presents a novel local feature descriptor based on the gradient distance and orientation histo...
Heng Yang, Qing Wang
DAGSTUHL
2003
15 years 7 months ago
Embodied Artificial Intelligence: Trends and Challenges
Abstract. The field of Artificial Intelligence, which started roughly half a century ago, has a turbulent history. In the 1980s there has been a major paradigm shift towards embodi...
Rolf Pfeifer, Fumiya Iida
AAAI
2000
15 years 7 months ago
Gridworlds as Testbeds for Planning with Incomplete Information
Gridworlds are popular testbeds for planning with incomplete information but not much is known about their properties. We study a fundamental planning problem, localization, to in...
Craig A. Tovey, Sven Koenig