Sciweavers

3360 search results - page 324 / 672
» Opportunistic Data Structures with Applications
Sort
View
SIAMJO
2008
85views more  SIAMJO 2008»
15 years 5 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
Igor Averbakh, Yun-Bin Zhao
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
14 years 8 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi
CIKM
2011
Springer
14 years 5 months ago
Scalable entity matching computation with materialization
Entity matching (EM) is the task of identifying records that refer to the same real-world entity from different data sources. While EM is widely used in data integration and data...
Sanghoon Lee, Jongwuk Lee, Seung-won Hwang
CIKM
2011
Springer
14 years 5 months ago
Keyword search over RDF graphs
Large knowledge bases consisting of entities and relationships between them have become vital sources of information for many applications. Most of these knowledge bases adopt the...
Shady Elbassuoni, Roi Blanco
PVLDB
2010
342views more  PVLDB 2010»
15 years 3 months ago
CRIUS: User-Friendly Database Design
Non-technical users are increasingly adding structures to their data. This gives rise to the need for database design. However, traditional database design is deliberate and heavy...
Li Qian, Kristen LeFevre, H. V. Jagadish