Sciweavers

501 search results - page 70 / 101
» Event-Feeded Dimension Solution
Sort
View
DIS
2010
Springer
14 years 9 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...
ICCAD
1997
IEEE
86views Hardware» more  ICCAD 1997»
15 years 4 months ago
Interconnect design for deep submicron ICs
Interconnect has become the dominating factor in determining circuit performance and reliability in deep submicron designs. In this embedded tutorial, we first discuss the trends...
Jason Cong, David Zhigang Pan, Lei He, Cheng-Kok K...
FOCS
2004
IEEE
15 years 3 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
COMPGEOM
2008
ACM
15 years 1 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
LWA
2004
15 years 1 months ago
VISION - a Semantic Web Portal for Describing the State-of-the-art on European Knowledge Management
For the realization of this strategic roadmap project a scenario-driven approach has been used, i.e. several scenarios for possible future applications concerning KM have been deve...
Mark Hefke