Sciweavers

1656 search results - page 111 / 332
» Labeling Schemes with Queries
Sort
View
ICDE
2009
IEEE
176views Database» more  ICDE 2009»
16 years 8 months ago
Efficient Table Anonymization for Aggregate Query Answering
Abstract-- Privacy protection is a major concern when microdata needs to be released for ad hoc analyses. This has led to a lot of recent research in privacy goals and table anonym...
Cecilia M. Procopiuc, Divesh Srivastava
MATES
2005
Springer
16 years 9 days ago
Semantic Methods for P2P Query Routing
Knowledge sharing in a virtual organization requires a knowledge life cycle including knowledge provisioning, terminology alignment, determination of resource location, query routi...
Alexander Löser, Steffen Staab, Christoph Tem...
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
16 years 1 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
JCO
2011
115views more  JCO 2011»
15 years 1 months ago
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
Chen Liao, Shiyan Hu
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
16 years 8 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei