Sciweavers

526 search results - page 95 / 106
» On the Number of Minimal Addition Chains
Sort
View
IPSN
2005
Springer
15 years 3 months ago
Quantizer design and distributed encoding algorithm for source localization in sensor networks
— In this paper, we propose a quantizer design algorithm that is optimized for source localization in sensor networks. For this application, the goal is to minimize the amount of...
Yoon Hak Kim, Antonio Ortega
LPAR
2004
Springer
15 years 3 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
SIGECOM
2003
ACM
128views ECommerce» more  SIGECOM 2003»
15 years 2 months ago
A reputation-based trust model for peer-to-peer ecommerce communities
Peer-to-Peer eCommerce communities are commonly perceived as an environment offering both opportunities and threats. One way to minimize threats in such an open community is to us...
Li Xiong, Ling Liu
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
15 years 2 months ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov
VR
2002
IEEE
132views Virtual Reality» more  VR 2002»
15 years 2 months ago
Pop Through Button Devices for VE Navigation and Interaction
We present a novel class of virtual reality input devices that combine pop through buttons with 6 DOF trackers. Compared to similar devices that use conventional buttons, pop thro...
Robert C. Zeleznik, Joseph J. LaViola Jr., Daniel ...