Sciweavers

485 search results - page 39 / 97
» Iterative Bounding LAO
Sort
View
CAV
2007
Springer
112views Hardware» more  CAV 2007»
15 years 10 months ago
Magnifying-Lens Abstraction for Markov Decision Processes
ng-Lens Abstraction for Markov Decision Processes⋆ In Proc. of CAV 2007: 19th International Conference on Computer-Aided Verification, Lectures Notes in Computer Science. c Spri...
Luca de Alfaro, Pritam Roy
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
15 years 8 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
15 years 8 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
ML
2002
ACM
141views Machine Learning» more  ML 2002»
15 years 4 months ago
On the Existence of Linear Weak Learners and Applications to Boosting
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
Shie Mannor, Ron Meir
ICDE
1999
IEEE
113views Database» more  ICDE 1999»
16 years 5 months ago
I/O Complexity for Range Queries on Region Data Stored Using an R-tree
In this paper we study the node distribution of an Rtree storing region data, like for instance islands, lakes or human-inhabited areas. We will show that real region datasets are...
Guido Proietti, Christos Faloutsos