Sciweavers

1950 search results - page 179 / 390
» Varieties of Increasing Trees
Sort
View
NAACL
2010
13 years 8 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
PC
2011
413views Management» more  PC 2011»
13 years 5 months ago
Exploiting thread-level parallelism in the iterative solution of sparse linear systems
We investigate the efficient iterative solution of large-scale sparse linear systems on shared-memory multiprocessors. Our parallel approach is based on a multilevel ILU precondit...
José Ignacio Aliaga, Matthias Bollhöfe...
PVLDB
2010
128views more  PVLDB 2010»
13 years 5 months ago
Searching Workflows with Hierarchical Views
Workflows are prevalent in diverse applications, which can be scientific experiments, business processes, web services, or recipes. With the dramatically growing number of workflo...
Ziyang Liu, Qihong Shao, Yi Chen
CIDR
2011
237views Algorithms» more  CIDR 2011»
13 years 2 months ago
Rethinking Database Algorithms for Phase Change Memory
Phase change memory (PCM) is an emerging memory technology with many attractive features: it is non-volatile, byte-addressable, 2–4X denser than DRAM, and orders of magnitude be...
Shimin Chen, Phillip B. Gibbons, Suman Nath
SIGUCCS
2005
ACM
14 years 4 months ago
A case study: implementing novell identity management at Drew University
Starting in 2003, Drew University began a process to replace its manual account management procedures with an automated provisioning system based upon Novell technologies. Over th...
E. Axel Larsson