Sciweavers

145 search results - page 15 / 29
» The Theory Grid and Grid Theorists
Sort
View
ICIP
2005
IEEE
14 years 9 months ago
Hexagonal versus orthogonal lattices: a new comparison using approximation theory
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the "natural" spline basis func...
Laurent Condat, Dimitri Van De Ville, Thierry Blu
MOBICOM
2004
ACM
14 years 1 months ago
On k-coverage in a mostly sleeping sensor network
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
Santosh Kumar, Ten-Hwang Lai, József Balogh
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
14 years 2 months ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar
ICEIS
2003
IEEE
14 years 1 months ago
Formalizing Types with Ultimate Closure for Middleware Tools in Information Systems Engineering
: A definition of types in an information system is given from real-world abstractions through data constructs, schema and definitions to physical data values. Category theory su...
B. Nick Rossiter, David A. Nelson, Michael A. Heat...
ICPP
2009
IEEE
14 years 2 months ago
Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...
Jonathan Widger, Daniel Grosu