Sciweavers

2376 search results - page 391 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
DAWAK
2006
Springer
14 years 19 days 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...
FPGA
2000
ACM
114views FPGA» more  FPGA 2000»
14 years 16 days ago
Generating highly-routable sparse crossbars for PLDs
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
Guy G. Lemieux, Paul Leventis, David M. Lewis
CDC
2009
IEEE
114views Control Systems» more  CDC 2009»
14 years 11 days ago
Parametric model order reduction accelerated by subspace recycling
Abstract-- Many model order reduction methods for parameterized systems need to construct a projection matrix V which requires computing several moment matrices of the parameterize...
Lihong Feng, Peter Benner, Jan G. Korvink
CPAIOR
2006
Springer
13 years 11 months ago
Conflict-Directed A* Search for Soft Constraints
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
Martin Sachenbacher, Brian C. Williams
AAAI
2010
13 years 10 months ago
Prioritization of Domain-Specific Web Information Extraction
It is often desirable to extract structured information from raw web pages for better information browsing, query answering, and pattern mining. Many such Information Extraction (...
Jian Huang, Cong Yu