Sciweavers

2100 search results - page 194 / 420
» Fundamentals of the problem
Sort
View
RSP
1999
IEEE
128views Control Systems» more  RSP 1999»
15 years 5 months ago
3-D Floorplanning: Simulated Annealing and Greedy Placement Methods for Reconfigurable Computing Systems
The advances in the programmable hardware has lead to new architectures where the hardware can be dynamically adapted to the application to gain better performance. There are stil...
Kia Bazargan, Ryan Kastner, Majid Sarrafzadeh
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
15 years 4 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
SODA
2007
ACM
106views Algorithms» more  SODA 2007»
15 years 2 months ago
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
Ittai Abraham, Yair Bartal, Ofer Neiman
UAI
2003
15 years 2 months ago
Updating with incomplete observations
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental pro...
Gert de Cooman, Marco Zaffalon
104
Voted
BMCBI
2008
114views more  BMCBI 2008»
15 years 27 days ago
Combining classifiers for improved classification of proteins from sequence or structure
Background: Predicting a protein's structural or functional class from its amino acid sequence or structure is a fundamental problem in computational biology. Recently, there...
Iain Melvin, Jason Weston, Christina S. Leslie, Wi...