Sciweavers

1195 search results - page 162 / 239
» Modeling an Algebraic Stepper
Sort
View
BIRTHDAY
2009
Springer
16 years 27 days ago
Nonassociative Lambek Calculus with Additives and Context-Free Languages
We study Nonassociative Lambek Calculus with additives ∧, ∨, satisfying the distributive law (Distributive Full Nonassociative Lambek Calculus DFNL). We prove that categorial g...
Wojciech Buszkowski, Maciej Farulewski
LFCS
2007
Springer
16 years 7 days ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang
CW
2006
IEEE
16 years 5 days ago
A New Method for Developing Business Applications: The Cellular Data System
Currently, in the development of business applications, difficulties occasionally arise between the customer side and the supplier side, causing delays and higher development cost...
Toshio Kodama, Tosiyasu L. Kunii, Yoichi Seki
ADC
2005
Springer
114views Database» more  ADC 2005»
15 years 11 months ago
Optimization of Relational Preference Queries
The design and implementation of advanced personalized database applications requires a preference-driven approach. Representing preferences as strict partial orders is a good cho...
Bernd Hafenrichter, Werner Kießling
144
Voted
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
15 years 11 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee