Sciweavers

841 search results - page 82 / 169
» Approximability of Minimum AND-Circuits
Sort
View
JALC
2007
90views more  JALC 2007»
13 years 10 months ago
Learning Unary Automata
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
Gregor Gramlich, Ralf Herrmann
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
14 years 2 months ago
EWA: exact wiring-sizing algorithm
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
Rony Kay, Gennady Bucheuv, Lawrence T. Pileggi
GLOBECOM
2007
IEEE
14 years 2 months ago
Efficient Self Protection Algorithms for Static Wireless Sensor Networks
Wireless sensor networks have been widely used in many surveillance applications. Due to the importance of sensor nodes in such applications, certain level of protection needs to b...
Yu Wang 0003, Xiang-Yang Li, Qian Zhang
DCOSS
2006
Springer
14 years 1 months ago
Optimal Placement and Selection of Camera Network Nodes for Target Localization
The paper studies the optimal placement of multiple cameras and the selection of the best subset of cameras for single target localization in the framework of sensor networks. The ...
Ali Ozer Ercan, Danny B. Yang, Abbas El Gamal, Leo...
DASFAA
2008
IEEE
116views Database» more  DASFAA 2008»
13 years 12 months ago
MBR Models for Uncertainty Regions of Moving Objects
The increase in the advanced location based services such as traffic coordination and management necessitates the need for advanced models tracking the positions of Moving Objects ...
Shayma Alkobaisi, Wan D. Bae, Seon Ho Kim, Byunggu...