Sciweavers

158 search results - page 23 / 32
» Some counting problems related to permutation groups
Sort
View
CN
2004
150views more  CN 2004»
13 years 7 months ago
Optimizing interconnection policies
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
Oliver Heckmann, Jens Schmitt, Ralf Steinmetz
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
13 years 11 months ago
Query Execution Techniques for Caching Expensive Methods
Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods a...
Joseph M. Hellerstein, Jeffrey F. Naughton
ICMCS
2008
IEEE
173views Multimedia» more  ICMCS 2008»
14 years 2 months ago
Improvement of the embedding efficiency of LSB matching by sum and difference covering set
As an important attribute directly influencing the steganographic scheme, the embedding efficiency is defined as the average number of random data bits per one embedding change...
Xiaolong Li, Tieyong Zeng, Bin Yang
ECOOP
2007
Springer
14 years 1 months ago
Matching Objects with Patterns
Data in object-oriented programming is organized in a hierarchy of classes. The problem of object-oriented pattern matching is how to explore this hierarchy from the outside. This ...
Burak Emir, Martin Odersky, John Williams
ACSW
2004
13 years 9 months ago
A fuzzy ontology for medical document retrieval
Ontologies represent a method of formally expressing a shared understanding of information, and have been seen by many authors as a prerequisite for the "Semantic web". ...
David Parry