Sciweavers

159 search results - page 13 / 32
» A new algorithmic approach to the computation of Minkowski f...
Sort
View
FOCS
2005
IEEE
14 years 1 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
KDD
2003
ACM
205views Data Mining» more  KDD 2003»
14 years 8 months ago
The data mining approach to automated software testing
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
Mark Last, Menahem Friedman, Abraham Kandel
CVPR
2011
IEEE
13 years 3 months ago
Submodularity beyond submodular energies: coupling edges in graph cuts
We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an efï¬...
Stefanie Jegelka, Jeff Bilmes
IROS
2009
IEEE
172views Robotics» more  IROS 2009»
14 years 2 months ago
Pairwise region-based scan alignment
— In this paper, we present a new algorithm for the alignment of two 3D scans. The approach uses a region-based matching technique. We make no assumptions about the initial posit...
Carla Silva Rocha Aguiar, Sébastien Druon, ...
ESTIMEDIA
2005
Springer
14 years 1 months ago
Custom Processor Design Using NISC: A Case-Study on DCT algorithm
Designing Application-Specific Instruction-set Processors (ASIPs) usually requires designing a custom datapath, and modifying instruction-set, instruction decoder, and compiler. A...
Bita Gorjiara, Daniel D. Gajski