Sciweavers

5592 search results - page 912 / 1119
» On Random Betweenness Constraints
Sort
View
DAWAK
2006
Springer
15 years 10 months ago
Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
Jiuyong Li, Raymond Chi-Wing Wong, Ada Wai-Chee Fu...
EELC
2006
124views Languages» more  EELC 2006»
15 years 10 months ago
How Grammar Emerges to Dampen Combinatorial Search in Parsing
Abstract. According to the functional approach to language evolution (inspired by cognitive linguistics and construction grammar), grammar arises to deal with issues in communicati...
Luc Steels, Pieter Wellens
EUROPAR
2006
Springer
15 years 10 months ago
A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
Hyungsoo Jung, Heon Young Yeom
ATS
2001
IEEE
126views Hardware» more  ATS 2001»
15 years 10 months ago
Design of an Optimal Test Access Architecture Using a Genetic Algorithm
Test access is a major problem for core-based systemon-chip (SOC) designs. Since cores in an SOC are not directly accessible via chip inputs and outputs, special access mechanisms...
Zahra Sadat Ebadi, André Ivanov
EWCBR
2000
Springer
15 years 10 months ago
Remembering Why to Remember: Performance-Guided Case-Base Maintenance
An important focus of recent CBR research is on how to develop strategies for achieving compact, competent case-bases, as a way to improve the performance of CBR systems. However, ...
David B. Leake, David C. Wilson