Sciweavers

6562 search results - page 1179 / 1313
» Noetherianity and Combination Problems
Sort
View
IJPP
2006
145views more  IJPP 2006»
15 years 6 months ago
Deterministic Parallel Processing
Abstract. In order to address the problems faced in the wireless communications domain, picoChip has devised the picoArrayTM . The picoArrayTM is a tiled-processor architecture, co...
Gajinder Panesar, Daniel Towner, Andrew Duller, Al...
ISI
2006
Springer
15 years 6 months ago
Measures to Detect Word Substitution in Intercepted Communication
Abstract. Those who want to conceal the content of their communications can do so by replacing words that might trigger attention by other words or locutions that seem more ordinar...
SzeWang Fong, David B. Skillicorn, Dmitri Roussino...
JNSM
2008
130views more  JNSM 2008»
15 years 6 months ago
Declarative Infrastructure Configuration Synthesis and Debugging
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
Sanjai Narain, Gary Levin, Sharad Malik, Vikram Ka...
DAM
2007
177views more  DAM 2007»
15 years 6 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
JCT
2006
100views more  JCT 2006»
15 years 6 months ago
Enumeration of unrooted maps of a given genus
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
Alexander Mednykh, Roman Nedela
« Prev « First page 1179 / 1313 Last » Next »