9842 search results - page 1690 / 1969 » The Complexity of the Matching-Cut Problem |
127
click to vote
PKC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
144
click to vote
CODES
2006
IEEE
15 years 10 months ago
2006
IEEE
The use of Application Specific Instruction-set Processors (ASIP) is a solution to the problem of increasing complexity in embedded systems design. One of the major challenges in...
130
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— We propose a novel solution to the problem of inverse kinematics for redundant robotic manipulators for the purposes of goal selection for path planning. We unify the calculati...
160
Voted
ISQED
2006
IEEE
15 years 10 months ago
2006
IEEE
— With advanced VLSI manufacturing technology in deep submicron (DSM) regime, we can integrate entire electronic systems on a single chip (SoC). Due to the complexity in SoC desi...
146
click to vote
PODC
2006
ACM
15 years 10 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...