Sciweavers

3652 search results - page 202 / 731
» A study of query length
Sort
View
UIST
2003
ACM
14 years 1 months ago
Considering the direction of cursor movement for efficient traversal of cascading menus
Cascading menus are commonly seen in most GUI systems. However, people sometimes choose the wrong items by mistake, or become frustrated when submenus pop up unnecessarily. This p...
Masatomo Kobayashi, Takeo Igarashi
ISAAC
2001
Springer
98views Algorithms» more  ISAAC 2001»
14 years 20 days ago
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
Hideaki Hori, Shinichi Shimozono, Masayuki Takeda,...
EUROCODE
1990
14 years 8 days ago
Linear complexity of transformed sequences
: This paper deals with the effect of bit change errors on the linear complexity of finite sequences. Though a change in a single bit can cause a large change in linear complexity,...
Harriet J. Fell
COCOON
2006
Springer
13 years 12 months ago
A Detachment Algorithm for Inferring a Graph from Path Frequency
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
Hiroshi Nagamochi
ACNS
2006
Springer
96views Cryptology» more  ACNS 2006»
13 years 10 months ago
On Optimizing the Security-Throughput Trade-Off in Wireless Networks with Adversaries
In this paper, we model the adversary (eavesdropper) present in the wireless communication medium using probabilistic models. We precisely formulate the security-throughput optimiz...
Mohamed A. Haleem, Chetan Nanjunda Mathur, Rajarat...