Sciweavers

379 search results - page 44 / 76
» The Graham-Knowlton Problem Revisited
Sort
View
DCG
2007
104views more  DCG 2007»
13 years 7 months ago
Coincidence Site Modules in 3-Space
The coincidence site lattice (CSL) problem and its generalization to Z-modules in Euclidean 3-space is revisited, and various results and conjectures are proved in a unified way, ...
Michael Baake, Peter A. B. Pleasants, Ulf Rehmann
ICSE
1999
IEEE-ACM
13 years 12 months ago
Splitting the Organization and Integrating the Code: Conway's Law Revisited
It is widely acknowledged that coordination of large scale software development is an extremely difficult and persistent problem. Since the structure of the code mirrors the struc...
James D. Herbsleb, Rebecca E. Grinter
ALGORITHMICA
2010
155views more  ALGORITHMICA 2010»
13 years 7 months ago
Bin Packing with Rejection Revisited
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
Leah Epstein
CP
2008
Springer
13 years 9 months ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...
CORR
2006
Springer
66views Education» more  CORR 2006»
13 years 7 months ago
MDL Denoising Revisited
We refine and extend an earlier MDL denoising criterion for wavelet-based denoising. We start by showing that the denoising problem can be reformulated as a clustering problem, whe...
Teemu Roos, Petri Myllymäki, Jorma Rissanen