Sciweavers

612 search results - page 79 / 123
» Hardness assumptions in the foundations of theoretical compu...
Sort
View
AI
2010
Springer
13 years 8 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
ACSC
2006
IEEE
14 years 1 months ago
Manufacturing opaque predicates in distributed systems for code obfuscation
Code obfuscation is a relatively new technique of software protection and it works by deterring reverse engineering attempts by malicious users of software. The objective of obfus...
Anirban Majumdar, Clark D. Thomborson
MOBICOM
2004
ACM
14 years 1 months ago
Power conservation and quality of surveillance in target tracking sensor networks
Target tracking is an important application of wireless sensor networks. In this application, the sensor nodes collectively monitor and track the movement of an event or target ob...
Chao Gui, Prasant Mohapatra
SEMCO
2009
IEEE
14 years 2 months ago
An Algebraic Language for Semantic Data Integration on the Hidden Web
Semantic integration in the hidden Web is an emerging area of research where traditional assumptions do not always hold. Frequent changes, conflicts and the sheer size of the hid...
Shazzad Hosain, Hasan M. Jamil
COMPGEOM
2004
ACM
13 years 11 months ago
Continuous path verification in multi-axis NC-machining
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperi...