4047 search results - page 11 / 810 » Some Properties and Some Problems on Set Functors |
93
Voted
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
84
Voted
TIT
2008
14 years 11 months ago
2008
We consider the design of systems for sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the samp...
98
Voted
IJSNET
2007
14 years 11 months ago
2007
Abstract: Wireless sensor networks are often based on omni-sensing and communication models. In contrast, in this paper, we investigate sensor networks with directional sensing and...
93
Voted
COCOA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
GCC
2003
Springer
15 years 4 months ago
2003
Springer
We use 2-Dimensional language to construct 2-Dimensional computer graphics model, use MSO or other logics to specify some graph property, and use automata model checking technique ...