Sciweavers

2659 search results - page 52 / 532
» Do we mean the same
Sort
View
ISAAC
2009
Springer
83views Algorithms» more  ISAAC 2009»
15 years 10 months ago
Deletion without Rebalancing in Multiway Search Trees
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
Siddhartha Sen, Robert Endre Tarjan
ECAI
2010
Springer
15 years 2 months ago
Behavior-Oriented Commitment-based Protocols
Ever since the seminal work of Searle, two components of interaction protocols have been identified: constitutive rules, defining the meaning of actions and regulative rules, defin...
Matteo Baldoni, Cristina Baroglio, Elisa Marengo
CSR
2010
Springer
15 years 9 months ago
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems
We show that a logical framework, based around a fragment of existential second-order logic formerly proposed by others so as to capture the class of polynomially-bounded P-optimi...
James Gate, Iain A. Stewart
128
Voted
LREC
2008
88views Education» more  LREC 2008»
15 years 5 months ago
Lexical Substitution as a Framework for Multiword Evaluation
In this paper we analyse data from the SemEval lexical substitution task in those cases where the annotators indicated that the target word was part of a phrase before substitutin...
Diana McCarthy
ECCV
2008
Springer
16 years 6 months ago
Quick Shift and Kernel Methods for Mode Seeking
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
Andrea Vedaldi, Stefano Soatto