Sciweavers

2314 search results - page 120 / 463
» Minimal Partitions of a Graph
Sort
View
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
16 years 16 days ago
Probe Matrix Problems: Totally Balanced Matrices
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
David B. Chandler, Jiong Guo, Ton Kloks, Rolf Nied...
DLOG
2011
14 years 10 months ago
Integrity Constraints for Linked Data
Linked Data makes one central addition to the Semantic Web principles: all entity URIs should be dereferenceable to provide an authoritative RDF representation. URIs in a linked da...
Alan Jeffrey, Peter F. Patel-Schneider
DCC
2008
IEEE
16 years 6 months ago
On vector space partitions and uniformly resolvable designs
Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained ...
Andrew Blinco, Saad El-Zanati, G. F. Seelinger, P....
EGH
2004
Springer
15 years 10 months ago
Efficient partitioning of fragment shaders for multiple-output hardware
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
Tim Foley, Mike Houston, Pat Hanrahan
CDC
2008
IEEE
102views Control Systems» more  CDC 2008»
16 years 25 days ago
Area-constrained coverage optimization by robotic sensor networks
Abstract— This paper studies robotic sensor networks performing coverage optimization tasks with area constraints. The network coverage of the environment is a function of the ro...
Jorge Cortés