Sciweavers

5494 search results - page 863 / 1099
» E-services Management Requirements
Sort
View
CSREAESA
2004
15 years 8 months ago
A High Performance, Low Area Overhead Carry Lookahead Adder
Adders are some of the most critical data path circuits requiring considerable design effort in order to "squeeze" out as much performance gain as possible. Many adder d...
James Levy, Jabulani Nyathi
DGO
2006
112views Education» more  DGO 2006»
15 years 8 months ago
Matching and integration across heterogeneous data sources
A sea of undifferentiated information is forming from the body of data that is collected by people and organizations, across government, for different purposes, at different times...
Patrick Pantel, Andrew Philpot, Eduard H. Hovy
DLOG
2006
15 years 8 months ago
Data Complexity of Answering Unions of Conjunctive Queries in SHIQ
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
FLAIRS
2004
15 years 8 months ago
Natural Language Generation and Discourse Context: Computing Distractor Sets from the Focus Stack
In human-human conversation, people use linguistic expressions that are flexibly tailored to context as a matter of course, and they expect their conversational partners to do lik...
David DeVault, Charles Rich, Candace L. Sidner
FCS
2006
15 years 8 months ago
Principles of Optimal Probabilistic Decision Tree Construction
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina,...