Sciweavers

4698 search results - page 75 / 940
» Making Functionality More General
Sort
View
DAGSTUHL
2006
15 years 4 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum
AINA
2004
IEEE
15 years 7 months ago
Using the Extension Function of XSLT and DSL to Secure XML Documents
XSLT is a very popular and flexible language for transforming XML documents which provides a powerful implementation of a tree-oriented transformation language for transmuting ins...
Tao-Ku Chang, Gwan-Hwan Hwang
CIKM
2010
Springer
15 years 1 months ago
Examining the information retrieval process from an inductive perspective
Term-weighting functions derived from various models of retrieval aim to model human notions of relevance more accurately. However, there is a lack of analysis of the sources of e...
Ronan Cummins, Mounia Lalmas, Colm O'Riordan
ITCC
2002
IEEE
15 years 8 months ago
FSM Implementation in Embedded Memory Blocks of Programmable Logic Devices Using Functional Decomposition
: Since modern programmable devices contain embedded memory blocks, there exists a possibility to implement Finite State Machines (FSM) using such blocks. The size of the memory av...
Henry Selvaraj, Mariusz Rawski, Tadeusz Luba
ISIPTA
1999
IEEE
114views Mathematics» more  ISIPTA 1999»
15 years 7 months ago
Lower Desirability Functions: A Convenient Imprecise Hierarchical Uncertainty Model
I introduce and study a fairly general imprecise secondorder uncertainty model, in terms of lower desirability. A modeller's lower desirability for a gamble is defined as her...
Gert De Cooman